Eight degrees of separation

The paper presents a model of network formation where every connected couple give a contribution to the aggregate payoff, eventually discounted by their distance, and the resources are split between agents through the Myerson value. As equilibrium concept we adopt a refinement of pairwise stability. The only parameters are the number N of agents and a constant cost k for every agent to maintain any single link. This setup shows a wide multiplicity of equilibria, all of them connected, as k ranges over non trivial cases. We are able to show that, for any N, when the equilibrium is a tree (acyclical connected graph), which happens for high k, and there is no decay, the diameter of such a network never exceeds 8 (i.e. there are no two nodes with distance greater than 8). Adopting no decay and studying only trees, we facilitate the analysis but impose worst-case scenarios: we conjecture that the limit of 8 should apply for any possible non--empty equilibrium with any decay function.Network Formation, Myerson value

Eight Degrees of Separation

The paper presents a model of network formation where every connected couple gives a contribution to the aggregate payoff, eventually discounted by their distance, and the resources are split between agents through the Myerson value. As equilibrium concept we adopt a refinement of pairwise stability. The only parameters are the number N of agents and a constant cost k for every agent to maintain any single link. This setup shows a wide multiplicity of equilibria, all of them connected, as k ranges over non trivial cases. We are able to show that, for any N, when the equilibrium is a tree (acyclical connected graph), which happens for high k, and there is no decay, the diameter of such a network never exceeds 8 (i.e. there are no two nodes with distance greater than 8). Adopting no decay and studying only trees, we facilitate the analysis but impose worst–case scenarios: we conjecture that the limit of 8 should apply for any possible non–empty equilibrium with any decay function.Network Formation, Myerson Value

Stochastic network formation and homophily

This is a chapter of the forthcoming Oxford Handbook on the Economics of Networks

Stochastic Stability in the Best Shot Game

The best shot game applied to networks is a discrete model of many processes of contribution to local public goods. It has generally a wide multiplicity of equilibria that we refine through stochastic stability. In this paper we show that, depending on how we define perturbations, i.e. the possible mistakes that agents can make, we can obtain very different sets of stochastically stable equilibria. In particular and non-trivially, if we assume that the only possible source of error is that of an agent contributing that stops doing so, then the only stochastically stable equilibria are those in which the maximal number of players contributes.Networks, Best Shot Game, Stochastic Stability

Paying Positive to Go Negative: Advertisers' Competition and Media Reports

This paper analyzes a two-sided market for news where advertisers may pay a media outlet to conceal negative information about the quality of their own product (paying positive to avoid negative) and/or to disclose negative information about the quality of their competitors' products (paying positive to go negative). We show that whether advertisers have negative consequences on the accuracy of news reports or not ultimately depends on the extent of correlation among advertisers' products. Specifically, the lower the correlation among the qualities of the advertisers' products, the (weakly) higher the accuracy of the media outlet' reports. Moreover, when advertisers' products are correlated, a higher degree of competition in the market of the advertisers' products may decrease the accuracy of the media outlet's reports

A network centrality method for the rating problem

We propose a new method for aggregating the information of multiple reviewers rating multiple products. Our approach is based on the network relations induced between products by the rating activity of the reviewers. We show that our method is algorithmically implementable even for large numbers of both products and consumers, as is the case for many online sites. Moreover, comparing it with the simple average, which is mostly used in practice, and with other methods previously proposed in the literature, it performs very well under various dimension, proving itself to be an optimal trade--off between computational efficiency, accordance with the reviewers original orderings, and robustness with respect to the inclusion of systematically biased reports.Comment: 25 pages, 8 figure

Spreading of an infectious disease between different locations

The endogenous adaptation of agents, that may adjust their local contact network in response to the risk of being infected, can have the perverse effect of increasing the overall systemic infectiveness of a disease. We study a dynamical model over two geographically distinct but interacting locations, to better understand theoretically the mechanism at play. Moreover, we provide empirical motivation from the Italian National Bovine Database, for the period 2006-2013.Comment: 22 pages (and 10 pages for appendix); 11 figures (2 in appendix

Optimal Equilibria of the Best Shot Game

We consider any network environment in which the “best shot game” is played. This is the case where the possible actions are only two for every node (0 and 1), and the best response for a node is 1 if and only if all her neighbors play 0. A natural application of the model is one in which the action 1 is the purchase of a good, which is locally a public good, in the sense that it will be available also to neighbors. This game will typically exhibit a great multiplicity of equilibria. Imagine a social planner whose scope is to find an optimal equilibrium, i.e. one in which the number of nodes playing 1 is minimal. To find such an equilibrium is a very hard task for any non-trivial network architecture. We propose an implementable mechanism that, in the limit of infinite time, reaches an optimal equilibrium, even if this equilibrium and even the network structure is unknown to the social planner.Networks, Best Shot Game, Simulated Annealing